Time-Aware Random Walk Diffusion to Improve Dynamic Graph Learning

نویسندگان

چکیده

How can we augment a dynamic graph for improving the performance of neural networks? Graph augmentation has been widely utilized to boost learning GNN-based models. However, most existing approaches only enhance spatial structure within an input static by transforming graph, and do not consider dynamics caused time such as temporal locality, i.e., recent edges are more influential than earlier ones, which remains challenging augmentation. In this work, propose TiaRa (Time-aware Random Walk Diffusion), novel diffusion-based method augmenting represented discrete-time sequence snapshots. For purpose, first design time-aware random walk proximity so that surfer along dimension well edges, resulting in spatially temporally localized scores. We then derive our diffusion matrices based on walk, show they become enhanced adjacency both localities augmented. Throughout extensive experiments, demonstrate effectively augments given leads significant improvements GNN models various datasets tasks.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Topology-Aware Random Walk

When a graph can be decomposed into clusters of well connected subgraphs, it is possible to speed up random walks taking advantage of the topology of the graph. In this work, a new random walk scheme is introduced and a condition is given when the new random walk performs better than the Metropolis algorithm.

متن کامل

From random walk to single-file diffusion.

We report an experimental study of diffusion in a quasi-one-dimensional (q1D) colloid suspension which behaves like a Tonks gas. The mean squared displacement as a function of time is described well with an ansatz encompassing a time regime that is both shorter and longer than the mean time between collisions. The ansatz asserts that the inverse mean squared displacement is the sum of the inver...

متن کامل

Fast Random Walk Graph Kernel

Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it suffers from the expensive computational cost which is at least O(n) or O(m) for graphs with n nodes and m edges. In this paper, we propose Ark, a set of fast algorithms for random walk graph kernel computation. Ark is...

متن کامل

Continuous time random walk and parametric subordination in fractional diffusion

The well-scaled transition to the diffusion limit in the framework of the theory of continuous-time random walk (CTRW) is presented starting from its representation as an infinite series that points out the subordinated character of the CTRW itself. We treat the CTRW as a combination of a random walk on the axis of physical time with a random walk in space, both walks happening in discrete oper...

متن کامل

Integrodifferential diffusion equation for continuous-time random walk.

In this paper, we present an integrodifferential diffusion equation for continuous-time random walk that is valid for a generic waiting time probability density function. Using this equation, we also study diffusion behaviors for a couple of specific waiting time probability density functions such as exponential and a combination of power law and generalized Mittag-Leffler function. We show tha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2023

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v37i7.26021